Reachability of locational Nash equilibria

Nash Equilibria for Reachability Objectives in Multi-player Timed Games

We propose a procedure for computing Nash equilibria in multi-player timed games with reachability objectives. Our procedure is based on the construction of a finite concurrent game, and on a generic characterization of Nash equilibria in (possibly infinite) concurrent games. Along the way, we use our characterization to compute Nash equilibria in finite concurrent games.

Universality of Nash Equilibria

Nash and Correlated Equilibria

In this document we will look at useful facts and definitions about Nash and correlated equilibria for two person games. More specifically we’ll give a brief definition of both equilibria, and then we’ll point out the relation between them. We will next introduce a numerical approach aimed at calculating Nash Equilibria of a symmetric game we wish to explore in CME 334. A motivation for this ap...

Coalitional Nash Equilibria

Let G be an N -player game in strategic form and C be a set of permissible coalition of players (exogenously given). A strategy profile σ is a coalitional-equilibrium if no permissible coalition in C has a unilateral deviation that profits to all its members. At the two extremes: when C contains only singleton players, σ reduces to a Nash equilibrium and when C consists on all coalitions of pla...

Symmetric Nash equilibria